Regeneration-based Multiversion Dynamic Voting Scheme for Replicated Database Systems. in 6th Ieee Conference On
نویسنده
چکیده
A pessimistic consistency control algorithm for replicated les which achieves high availability. of replicated objects: A technique and its eden A majority consensus approach to concurrency control for multiple copy databases.
منابع مشابه
Regeneration-Based Multiversion Dynamic Voting Scheme for Replicated Database Systems
12] S. Jajodia and D. Mutchler. A pessimistic consistency control algorithm for replicated les which achieves high availability. 20 ensures that the last copy is lost only when the last site of the current majority partition fails. This leads to improved availability as compared to the pure dynamic voting algorithm. An availability analysis of the RVC algorithm for the case of site failures con...
متن کاملMultiversion Reconciliation for Mobile Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allow optimistic replication of data by permitting disconnected mobile devices to perform local updates on replicated data. The fundamental problem in this approach is the reconciliation problem, i.e. the problem of serial...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملMultiversion Locking Protocol with Freezing for Secure Real-Time Database Systems
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and is represented as a priority to be used by schedulers. Recently, security has become another important issue in many real-time applications. In many systems, sensitive information is shared by multiple users with diff...
متن کاملHashing Methods for Temporal Data
External dynamic hashing has been used in traditional database systems as a fast method to answer membership queries. Given a dynamic set S of objects, a membership query asks whether an object with identity k is in the most current S. This paper addresses the more general problem of Temporal Hashing. In this setting changes to the dynamic set are timestamped and the membership query has a temp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991